package javaExample;

/**
 * @author admin
 * 冒泡排序
 */
public class BubbleSort {
	public static void main(String[] args) {
		int score[] = { 67, 69, 75, 87, 89, 90, 99 ,100};
		boolean flag = false;
		for (int i = 0; i < score.length - 1; i++) { // 最多做n-1趟排序
			flag =true;
			for (int j = 0; j < score.length - i - 1; j++) { // 对当前无序区间score[0......length-i-1]进行排序(j的范围很关键，这个范围是在逐步缩小的)
				if (score[j] < score[j + 1]) { // 把小的值交换到后面
					int temp = score[j];
					score[j] = score[j + 1];
					score[j + 1] = temp;
					flag = false;
				}
			}
			if(flag){
				break;
			}
			System.out.print("第" + (i + 1) + "次排序结果：");
			for (int a = 0; a < score.length; a++) {
				System.out.print(score[a] + "\t");
			}
			System.out.println("");
		}
		System.out.print("最终排序结果：");
		for (int a = 0; a < score.length; a++) {
			System.out.print(score[a] + "\t");
		}
		int a[] = {6,4,3,7};
		for(int i = 0;i<a.length-1;i++){
			for(int j =0;j<a.length-i-1;j++){
				if(a[j]>a[j+1]){
					int temp = a[j];
					a[j] = a[j+1];
					a[j+1] = temp;
				}
			} 
		}
		for(int s = 0;s<a.length;s++){
			System.out.println("");
			System.out.println(a[s]); 
		}
	}
}
